Permutations Defining Convex Permutominoes

نویسندگان

  • Antonio Bernini
  • Filippo Disanto
  • Renzo Pinzani
  • Simone Rinaldi
چکیده

A permutomino of size n is a polyomino determined by particular pairs (π1, π2) of permutations of size n, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n. Here we determine

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Number of Convex Permutominoes

Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this aim we define the transform of a generic pair of permutations, we characterize the transform of any pair defining a convex permutomino, and we solve the counting problem in the transformed space.

متن کامل

Characterization and enumeration of some classes of permutominoes

A permutomino of size n is a polyomino whose vertices define a pair of distinct permutations of length n. In this paper we treat various classes of convex permutominoes, including the parallelogram, the directed convex and the stack ones. Using bijective techniques we provide enumeration for each of these classes according to the size, and characterize the permutations which are associated with...

متن کامل

On the exhaustive generation of convex permutominoes

A permutomino of size n is a polyomino determined by a pair (π1, π2) of permutations of size n + 1, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n+ 1. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the exhaustive generation of a particular class of permutominoes, the convex permutominoes, proving that its cost is proportional to the number of...

متن کامل

ar X iv : 0 71 1 . 05 82 v 1 [ m at h . C O ] 5 N ov 2 00 7 PERMUTATIONS DEFINING CONVEX PERMUTOMINOES

A permutomino of size n is a polyomino determined by particular pairs (π1, π2) of permutations of size n, such that π1(i) 6= π2(i), for 1 ≤ i ≤ n. Here we determine the combinatorial properties and, in particular, the characterization for the permutations defining convex permutominoes. Using such a characterization, these permutations can be uniquely represented in terms of the so called square...

متن کامل

Tiling the Plane with Permutations

A permutomino is a polyomino uniquely defined by a pair of permutations. Recently permutominoes, and in particular convex permutominoes have been studied by several authors concerning their analytical and bijective enumeration, tomographical reconstruction, and the algebraic characterization of the associated permutations [2, 3]. On the other side, Beauquier and Nivat [5] introduced and gave a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007